Algorithmic Computation of Optimal Capacity in Multiservice MobileWireless Networks
نویسندگان
چکیده
SUMMARY In this paper we propose a new algorithm for computing the optimal configuration of the Multiple Fractional Guard Channel (MFGC) admission policy in multiservice mobile wireless networks. The optimal configuration maximizes the offered traffic that the system can handle while meeting certain QoS requirements. The proposed algorithm is shown to be more efficient than previous algorithms appeared in the literature.
منابع مشابه
Efficient Computation of Optimal Capacity in Multiservice Mobile Wireless Networks∗
In this paper we propose a new algorithm for computing the optimal parameters setting of the Multiple Fractional Guard Channel (MFGC) admission policy in multiservice mobile wireless networks. The optimal parameters setting maximizes the offered traffic that the system can handle while meeting certain QoS requirements. The proposed algorithm is shown to be more efficient than previous algorithm...
متن کاملXu, Peng. Qos Provisioning and Pricing in Multiservice Networks: Optimal and Adaptive Control over Measurement-based Scheduling. (under the Di- Rection of Professor Michael Devetsikiotis). Qos Provisioning and Pricing in Multiservice Networks: Optimal and Adaptive Control over Measurement-based Scheduling
XU, PENG. QoS Provisioning and Pricing in Multiservice Networks: Optimal and Adaptive Control over Measurement-based Scheduling. (Under the direction of Professor Michael Devetsikiotis). In order to ensure efficient performance under inherently and highly variable traffic in multiservice networks, we propose a generalized adaptive and optimal control framework to handle the resource allocation....
متن کاملاستفاده از الگوریتم ژنتیک در مسائل کوتاهترین مسیر چند معیاره بر پایه سیستمهای اطلاعات مکانی
Multi-criteria shortest path problems (MSPP) are called as NP-Hard. For MSPPs, a unique solution for optimizing all the criteria simultaneously will rarely exist in reality. Algorithmic and approximation schemes are available to solve these problems; however, the complexity of these approaches often prohibits their implementation on real-world applications. This paper describes the development ...
متن کاملA Heuristic Algorithm for Capacity Sizing of Fixed Routing Multiservice Erlang Loss Networks
This paper deals with optimum link capacity sizing in Erlang multiservice loss networks with fixed routing. The objective function is link capacity installation cost which is to be minimized subject to call blocking probability limits. We describe a new heuristic algorithm we use to find a close match solution to this optimization problem. The algorithm is based on knapsack reduced load approxi...
متن کاملLP-based Algorithm for Optimization in Multiservice IP Networks
The network design problem considered in this paper provides the basis for the solution of many interesting and practical engineering problems, of which one notable example is the link capacity expansion problem of existing communication networks. We are particularly interested in the possibility of using this problem as a subproblem when solving the planning and design problem of multiservice ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 88-B شماره
صفحات -
تاریخ انتشار 2005